2

Simple algorithms for approximating all roots of a polynomial with real roots

Year:
1990
Language:
english
File:
PDF, 1.37 MB
english, 1990
12

Allowable processing orders in the accelerated cascade algorithm

Year:
1986
Language:
english
File:
PDF, 668 KB
english, 1986
16

Lower Bounds for Computations with the Floor Operation

Year:
1991
Language:
english
File:
PDF, 1.72 MB
english, 1991
17

Lower bounds on communication complexity in distributed computer networks

Year:
1987
Language:
english
File:
PDF, 1.47 MB
english, 1987
23

A lower bound for integer greatest common divisor computations

Year:
1991
Language:
english
File:
PDF, 1.25 MB
english, 1991
24

An efficient parallel algorithm for shifting the root of a depth first spanning tree

Year:
1986
Language:
english
File:
PDF, 892 KB
english, 1986
26

Decomposition of product graphs into complete bipartite subgraphs

Year:
1985
Language:
english
File:
PDF, 291 KB
english, 1985
27

Trade-offs between communication and space

Year:
1992
Language:
english
File:
PDF, 1.35 MB
english, 1992
31

On the decidability of sparse univariate polynomial interpolation

Year:
1991
Language:
english
File:
PDF, 1.40 MB
english, 1991
33

A problem that is easier to solve on the unit-cost algebraic RAM

Year:
1992
Language:
english
File:
PDF, 240 KB
english, 1992
35

A tight bound for approximating the square root

Year:
1997
Language:
english
File:
PDF, 285 KB
english, 1997
38

The computational complexity of universal hashing

Year:
1993
Language:
english
File:
PDF, 891 KB
english, 1993
39

A direct version of Shamir and Snir's lower bounds on monotone circuit depth

Year:
1994
Language:
english
File:
PDF, 512 KB
english, 1994